Review of ElGamal DSS RSA Elliptic Curves

نویسنده

  • Debajit Ghosh
چکیده

We began the course with a discussion and review of private key cryptography and then started moving into the realm of public key cryptography. During this lecture, we will discuss four public key schemes. Even though RSA preceded the other schemes presented here, we will review ElGamal and introduce DSS rst (both mod p schemes), in hopes of providing more background and motivation for some of the concepts utilized in RSA. Finally, we will also provide a brief introduction to the theory of Elliptic Curves. Throughout this lecture, we will primarily consider public key cryptography as it relates to digital signatures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Information Security on Elliptic Curves

The aim of this paper is to provide an overview for the research that has been done so far on elliptic curves cryptography role in information security area. The elliptic curves cryptosystem is the newest public-key cryptographic system and represents a mathematically richer procedure then the traditional cryptosystem based on public-key, like RSA, Diffie-Hellman, ElGamal and Digital Signature ...

متن کامل

Efficient elliptic curve exponentiation

Elliptic curve cryptosystems, proposed by Koblitz([8]) and Miller([11]), can be constructed over a smaller definition field than the ElGamal cryptosystems([5]) or the RSA cryptosystems([16]). This is why elliptic curve cryptosystems have begun to attract notice. There are mainly two types in elliptic curve cryptosystems, elliptic curves E over IF2r and E over IFp. Some current systems based on ...

متن کامل

Encoding-Free ElGamal-Type Encryption Schemes on Elliptic Curves

At PKC 2006, Chevallier-Mames, Paillier, and Pointcheval proposed a very elegant technique over cyclic subgroups of Fp eliminating the need to encode the message as a group element in the ElGamal encryption scheme. Unfortunately, it is unclear how to adapt their scheme over elliptic curves. In a previous attempt, Virat suggested an adaptation of ElGamal to elliptic curves over the ring of dual ...

متن کامل

A secure approach for embedding message text on an elliptic curve defined over prime fields, and building 'EC-RSA-ELGamal' Cryptographic System

This paper presents a new probabilistic approach to embedding message text on an elliptic curve, by using the concept of the RSA Algorithm and its security, and such approach allows us discovering the message from the point, only according to the security of the RSA Algorithm. By mixing between the concept of this approach and the concept of EC-ELGamal Cryptographic System, we have built a cryp...

متن کامل

Finding Minimum Optimal Path Securely Using Homomorphic Encryption Schemes in Computer Networks

In this paper we find a secure routing protocol for computer networks, which finds minimum optimum path using homomorphic encryption schemes. We briefly look into the existing homomorphic encryption algorithms. We make use of ElGamal encryption, Elliptic Curve encryption and a privacy homomorphism, which exhibits the property of homomorphism in our new routing protocol. Elliptic curve exhibits ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997